package com.example.bst;

/**
 * @Date 2022/4/10
 * @Created by Jonathan
 */
public class lowestCommonAncestor {

    static class Node {
        Integer value;
        Node left;
        Node right;
    }

    /**
     * 给定一颗二叉树的头节点head,和另外两个节点a和b
     * 返回a和b的最低公共祖先
     * <p>
     * 这个实际上就是找初次交汇点
     */


    static class Info {
        public Node ans;
        public boolean find01;
        public boolean find02;


        public Info(Node ans, boolean find01, boolean find02) {
            this.ans = ans;
            this.find01 = find01;
            this.find02 = find02;
        }
    }
}
